An Upper Bound of the Bezout Number for Piecewise Algebraic Curves over a Rectangular Partition
نویسندگان
چکیده
A piecewise algebraic curve is a curve defined by the zero set of a bivariate spline function. Given two bivariate spline spaces Sm Δ and S t n Δ over a domain D with a partition Δ, the Bezout number BN m,r;n,t;Δ is defined as the maximum finite number of the common intersection points of two arbitrary piecewise algebraic curves f x, y 0 and g x, y 0, where f x, y ∈ Sm Δ and g x, y ∈ Sn Δ . In this paper, an upper bound of the Bezout number for piecewise algebraic curves over a rectangular partition is obtained.
منابع مشابه
New results on upper domatic number of graphs
For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...
متن کاملThe upper domatic number of powers of graphs
Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...
متن کاملALGEBRAIC NONLINEARITY IN VOLTERRA-HAMMERSTEIN EQUATIONS
Here a posteriori error estimate for the numerical solution of nonlinear Voltena- Hammerstein equations is given. We present an error upper bound for nonlinear Voltena-Hammastein integral equations, in which the form of nonlinearity is algebraic and develop a posteriori error estimate for the recently proposed method of Brunner for these problems (the implicitly linear collocation method)...
متن کاملGeneralized Bezout's theorem and its applications in coding theory
This paper presents a generalized Bezout theorem which can be used to determine a tighter lower bound of the number of distinct points of intersection of two or more plane curves. A new approach to determine a lower bound on the minimum distance for algebraic-geometric codes defined from a class of plane curves is introduced, based on the generalized Bezout theorem. Examples of more efficient l...
متن کاملDefinability and Fast Quantifier Elimination in Algebraically Closed Fields
The Bezout-Inequality, an afine version (not in&ding multiplicities) of the classical Bezout-Theorem is derived for applications in algebraic complexity theory. Upper hounds for the cardinality and number of sets definable by first order formulas over algebraically closed fields are given. This is used for fast quantifier elimination in algebraically closed fields.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012